github.com/andybalholm/brotli/matchfinder.absoluteMatch.End (field)

78 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L97: 		for j := m.End; j >= m.Start+3; j-- {
		bargain1.go#L179: 				nextOverlapSearch = max(nextOverlapSearch, m.Start+1, m.End-4)
		bargain2.go#L108: 		for j := m.End; j >= m.Start+3; j-- {
		bargain2.go#L195: 				nextOverlapSearch = max(nextOverlapSearch, m.Start+1, m.End-6)
		bargain2.go#L211: 				nextOverlapSearch = max(nextOverlapSearch, m.Start+1, m.End-6)
		bargain3.go#L114: 		for j := m.End; j >= m.Start+3; j-- {
		bargain3.go#L205: 				nextOverlapSearch = max(nextOverlapSearch, m.Start+1, m.End-6)
		bargain3.go#L221: 				nextOverlapSearch = max(nextOverlapSearch, m.Start+1, m.End-6)
		bargain3.go#L237: 				nextOverlapSearch = max(nextOverlapSearch, m.Start+1, m.End-6)
		emitter.go#L11: 	End int
		emitter.go#L30: 		Length:    m.End - m.Start,
		emitter.go#L33: 	e.NextEmit = m.End
		m4.go#L60: 	return (m.End-m.Start)*256 + (bits.LeadingZeros32(uint32(m.Start-m.Match))-32)*q.DistanceBitCost
		m4.go#L113: 		if matches[0] != (absoluteMatch{}) && i >= matches[0].End {
		m4.go#L117: 				if matches[1].End > matches[0].Start {
		m4.go#L118: 					matches[1].End = matches[0].Start
		m4.go#L120: 				if matches[1].End-matches[1].Start >= q.MinLength && q.score(matches[1]) > 0 {
		m4.go#L134: 				if m.End-m.Start >= q.MinLength {
		m4.go#L149: 		if i < matches[0].End && i != matches[0].End+2-q.HashLen {
		m4.go#L161: 			if m.End-m.Start > q.MinLength && q.score(m) > 0 {
		m4.go#L177: 				if m.End-m.Start > q.MinLength && q.score(m) > q.score(currentMatch) {
		m4.go#L183: 		if currentMatch.End-currentMatch.Start < q.MinLength {
		m4.go#L190: 			if currentMatch.Start <= matches[1].End {
		m4.go#L213: 		case matches[0].Start < matches[2].End:
		m4.go#L221: 		case matches[0].Start < matches[2].End+q.MinLength:
		m4.go#L233: 			if matches[2].End > matches[1].Start {
		m4.go#L234: 				matches[2].End = matches[1].Start
		m4.go#L235: 				if q.ChainLength > 0 && matches[2].End-matches[2].Start >= q.MinLength {
		m4.go#L248: 						if bytes.Equal(src[matches[2].Start:matches[2].End], src[pos:pos+matches[2].End-matches[2].Start]) {
		m4.go#L255: 			if matches[2].End-matches[2].Start >= q.MinLength && q.score(matches[2]) > 0 {
		m4.go#L264: 		if matches[1].End > matches[0].Start {
		m4.go#L265: 			matches[1].End = matches[0].Start
		m4.go#L267: 		if matches[1].End-matches[1].Start >= q.MinLength && q.score(matches[1]) > 0 {
		m4.go#L336: 		End:   end,
		pathfinder.go#L156: 		if i >= prevMatch.End && prevMatch != (absoluteMatch{}) {
		pathfinder.go#L161: 				if m.End-m.Start > q.MinLength {
		pathfinder.go#L170: 			if m.End-m.Start > q.MinLength {
		pathfinder.go#L187: 				if m.End-m.Start > q.MinLength && m.End-m.Start > currentMatch.End-currentMatch.Start {
		pathfinder.go#L194: 		if i < prevMatch.End && currentMatch.End-currentMatch.Start <= prevMatch.End-prevMatch.Start {
		pathfinder.go#L198: 			i = prevMatch.End
		pathfinder.go#L210: 		i = currentMatch.End + 2 - q.HashLen
		pathfinder.go#L246: 			if m.End > pending.End {
		pathfinder.go#L253: 			for j := m.Start + q.MinLength; j <= m.End; j++ {
		pathfinder.go#L273: 		if unmatched == 0 && pending.Start != i && pending.End >= i+q.MinLength &&
		pathfinder.go#L276: 			for j := i + q.MinLength; j <= pending.End; j++ {
		trio.go#L183: 			if matches[0].End > int(sLimit) {
		trio.go#L186: 			s = int32(max(matches[0].Start+2, matches[0].End-10))
		trio.go#L233: 			if newMatch.End-newMatch.Start <= matches[0].End-matches[0].Start {
		trio.go#L251: 			case matches[0].Start < matches[2].End:
		trio.go#L259: 			case matches[0].Start < matches[2].End+4:
		trio.go#L271: 				if matches[2].End > matches[1].Start {
		trio.go#L272: 					matches[2].End = matches[1].Start
		trio.go#L274: 				if matches[2].End-matches[2].Start >= 4 {
		trio.go#L282: 		for index0 < int32(matches[0].End) && index0 < sLimit {
		trio.go#L295: 			if matches[1].End > matches[0].Start {
		trio.go#L296: 				matches[1].End = matches[0].Start
		trio.go#L298: 			if matches[1].End-matches[1].Start >= 4 {
		zm.go#L165: 			if matches[0].End > int(sLimit) {
		zm.go#L168: 			s = int32(max(matches[0].Start+2, matches[0].End-6))
		zm.go#L211: 			if newMatch.End-newMatch.Start <= matches[0].End-matches[0].Start {
		zm.go#L229: 			case matches[0].Start < matches[2].End:
		zm.go#L237: 			case matches[0].Start < matches[2].End+4:
		zm.go#L249: 				if matches[2].End > matches[1].Start {
		zm.go#L250: 					matches[2].End = matches[1].Start
		zm.go#L252: 				if matches[2].End-matches[2].Start >= 4 {
		zm.go#L260: 		index1 := int32(matches[0].End - 2)
		zm.go#L274: 			if matches[1].End > matches[0].Start {
		zm.go#L275: 				matches[1].End = matches[0].Start
		zm.go#L277: 			if matches[1].End-matches[1].Start >= 4 {